package leetcode_201_300;

import node.TreeNode;

public class LeeCode_226 {
    public static void main(String[] args) {

    }
    private static TreeNode invertTree(TreeNode root) {
        f(root);
        return root;
    }
    private static void f(TreeNode node){
        if (node == null)
            return;
        TreeNode l = node.left;
        node.left = node.right;
        node.right = l;
        f(node.left);
        f(node.right);
    }
}
